Bounds for Multiprocessor Scheduling with Resource Constraints
نویسندگان
چکیده
منابع مشابه
Bounds for Multiprocessor Scheduling with Resource Constraints
One well-studied model of a multiprocessing system involves a fixed number n of identical abstract processors, a finite set of tasks to be executed, each requiring a specified amount of computation time, and a partial ordering on the tasks which requires certain tasks to be completed before certain others can be initiated. The nonpreemptive operation of the system is guided by an ordered list L...
متن کاملTardiness Bounds for Global Multiprocessor Scheduling Algorithms
From 10.02. to 15.02., the Dagstuhl Seminar 08071 Scheduling was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together ...
متن کاملImproved bounds for hybrid flow shop scheduling with multiprocessor tasks
In this paper, we investigate the problem of minimizing makespan in a multistage hybrid flow-shop scheduling with multiprocessor tasks. To generate high-quality approximate solutions to this challenging NP-hard problem, we propose a discrepancy search heuristic that is based on the new concept of adjacent discrepancies. Moreover, we describe a new lower bound based on the concept of dual feasib...
متن کاملLayer-Based Scheduling Algorithms for Multiprocessor-Tasks with Precedence Constraints
c © 2007 by John von Neumann Institute for Computing Permission to make digital or hard copies of portions of this work for personal or classroom use is granted provided that the copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise requires prior specific permission by the publisher ment...
متن کاملMultiprocessor system scheduling with precedence and resource constraints using an enhanced ant colony system
This study presents and evaluates a modified ant colony optimization (ACO) approach for the precedence and resource-constrained multiprocessor scheduling problems. A modified ant colony system is proposed to solve the scheduling problems. A two-dimensional matrix is proposed in this study for assigning jobs on processors, and it has a time-dependency relation structure. The dynamic rule is desi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 1975
ISSN: 0097-5397,1095-7111
DOI: 10.1137/0204015